Перевод: с английского на все языки

со всех языков на английский

Со всех языков на:
Английский
С английского на:
Русский

tree with labeled nodes

Толкование Перевод

1 tree with labeled nodes

Математика: дерево с помеченными вершинами

Универсальный англо-русский словарь > tree with labeled nodes
2 tree

1) дерево, древо || засаживать деревьями

2) древовидная схема; древовидная структура

3) т. граф. дерево

4) pl дендритные образования на катоде ( при электроосаждении металлов)

tree from point — дерево из точки

tree with labeled nodes — дерево с помеченными вершинами

tree with ordered vertices — дерево с упорядоченными вершинами

to transport felled trees — трелевать заготовленный лес

- acyclic tree

- alternating tree

- arithmetical tree

- augmenting tree

- auxiliary tree

- balanced tree

- bicentral tree

- bicentroidal tree

- bichromatic tree

- bifurcating tree

- binary tree

- blossomed tree

- branch of tree

- branch tree

- broad-leaved tree

- bushy tree

- Cayley tree

- choice tree

- closed tree

- cluster tree

- code tree

- colored tree

- compact tree

- complete tree

- completely balanced tree

- computable tree

- computation tree

- concave tree

- continuous tree

- cospectral tree

- countable tree

- crop tree

- decision tree

- decomposition tree

- deduction tree

- degenerated tree

- depth-balanced tree

- derivation tree

- diagnostic tree

- directed tree

- dominator tree

- dual tree

- economy tree

- edge-rooted tree

- empty tree

- explicite tree

- extended tree

- family tree

- finite rooted directed tree

- finite tree

- finite-path tree

- flexible tree

- flowered tree

- folded tree

- formulation tree

- free tree

- full tree

- function tree

- generalized tree

- generation tree

- hierarchical tree

- homeomorphically irreducible tree

- identity tree

- implicite tree

- inference tree

- infinite tree

- inverted tree

- isometric tree

- labeled tree

- language tree

- late binding tree

- left-threaded tree

- line-rooted tree

- logical tree

- mast tree

- maximal tree

- minimal spanning tree

- minimal tree

- mission outcome tree
- mixed star tree
- monotonic tree

- m-tier tree

- multibranch tree

- multiway tree

- n-ary tree

- n-dimensional tree

- neighboring trees

- nonbinary tree

- nonisomorphic tree

- normal tree

- null tree

- number tree

- one-level tree

- optimal solution tree

- optimum tree

- ordered tree

- oriented tree

- parametric tree

- parsing tree

- partition of tree

- periodic tree

- pitch-yielding tree

- planar tree
- plane tree
- planted tree

- potential solution tree

- prefix tree

- probability tree

- production tree

- prognostic tree

- projective tree

- prolific tree

- proof tree

- pseudosemantic tree

- quotient tree

- radix tree

- random tree

- recursive tree

- reduced tree

- refutation tree

- regular tree

- relevance tree

- response tree

- right-threaded tree

- rubber tree

- search tree

- semiinfinite tree

- sequential tree

- set tree

- shallow tree

- shortest spanning tree

- shortest tree

- shortest-distance tree

- signed tree

- sink tree

- smooth tree

- solution tree

- sorting tree

- spanning tree

- spar tree

- spectrum tree

- split tree

- star tree

- strongly recursive tree

- stunted tree

- subspanning tree

- successor tree

- suppressed tree

- symmetric tree

- syntax tree

- ternary tree

- timber tree

- topological tree

- transition tree

- tree of objectives

- tree of statements

- trivalent tree

- trivial tree

- two-colored tree

- two-dimensional tree

- two-level tree

- undirected tree

- unlabeled tree

- unrooted tree

- upside down tree

- utility tree

- wayside trees

- weight-balanced trees

- weighted tree

- well-founded tree

English-Russian scientific dictionary > tree

См. также в других словарях:

Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Tree-adjoining grammar — (TAG) is a grammar formalism defined by Aravind Joshi. Tree adjoining grammars are somewhat similar to context free grammars, but the elementary unit of rewriting is the tree rather than the symbol. Whereas context free grammars have rules for… … Wikipedia
Tree automaton — A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The following article deals with branching tree automata, which correspond to regular languages of… … Wikipedia
Phylogenetic tree — ptree redirects here. For Patricia tree, see Radix tree … Wikipedia
PQ tree — A PQ tree is a tree based data structure that represents a family of permutations on a set of elements, discovered and named by Kellogg S. Booth and George S. Lueker in 1976. It is a rooted, labeled tree, in which each element is represented by… … Wikipedia
Radix tree — In computer science, a radix tree (also patricia trie or radix trie) is a space optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. Unlike… … Wikipedia
Alternating decision tree — An Alternating Decision Tree (ADTree) is a machine learning methodfor classification. The ADTree data structure and algorithmare a generalization of decision trees and have connections to boosting. ADTrees were introduced by Yoav Freund and Llew… … Wikipedia
Computation tree — A computation tree is a representation for the computation steps of a non deterministic Turing machine on a specified input. A computation tree is a rooted tree of nodes and edges. Each node in the tree represents a single computational state,… … Wikipedia
Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… … Wikipedia
Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… … Wikipedia

Словари и энциклопедии на Академике

Перевод: с английского на все языки

tree with labeled nodes

См. также в других словарях:

Поделиться ссылкой на выделенное

Словари и энциклопедии на Академике

Перевод: с английского на все языки

tree with labeled nodes

См. также в других словарях:

Поделиться ссылкой на выделенное

Прямая ссылка: